Minimizing quadratic functions with separable quadratic constraints

نویسنده

  • Radek Kucera
چکیده

This article deals with minimizing quadratic functions with a special form of quadratic constraints that arise in 3D contact problems of linear elasticity with isotropic friction [Haslinger, J., Kučera, R. and Dostál, Z., 2004, An algorithm for the numerical realization of 3D contact problems with Coulomb friction. Journal of Computational and Applied Mathematics, 164/165, 387–408.]. The proposed algorithm combines the active set method with the conjugate gradient method. Its general scheme is similar to the algorithms of Polyak’s type that solve the quadratic programming problems with simple bounds. As the algorithm does not terminate in a finite number of steps, the convergence is proved. The implementation uses an adaptive precision control of the conjugate gradient loops. Numerical experiments demonstrate the computational efficiency of the method.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Convergence Rate of an Optimization Algorithm for Minimizing Quadratic Functions with Separable Convex Constraints

A new active set algorithm for minimizing quadratic functions with separable convex constraints is proposed by combining the conjugate gradient method with the projected gradient. It generalizes recently developed algorithms of quadratic programming constrained by simple bounds. A linear convergence rate in terms of the Hessian spectral condition number is proven. Numerical experiments, includi...

متن کامل

Some results for quadratic problems with one or two quadratic constraints

In this paper we discuss problems with quadratic objective function, one or two quadratic constraints, and, possibly, some additional linear constraints. In particular, we consider cases where the Hessian of the quadratic functions are simultaneously diagonalizable, so that the objective and constraint functions can all be converted into separable functions. We give conditions under which a sim...

متن کامل

FGP approach to multi objective quadratic fractional programming problem

Multi objective quadratic fractional programming (MOQFP) problem involves optimization of several objective functions in the form of a ratio of numerator and denominator functions which involve both contains linear and quadratic forms with the assumption that the set of feasible solutions is a convex polyhedral with a nite number of extreme points and the denominator part of each of the objecti...

متن کامل

SDO relaxation approach to fractional quadratic minimization with one quadratic constraint

In this paper, we study the problem of minimizing the ratio of two quadratic functions subject to a quadratic constraint. First we introduce a parametric equivalent of the problem. Then a bisection and a generalized Newton-based method algorithms are presented to solve it. In order to solve the quadratically constrained quadratic minimization problem within both algorithms, a semidefinite optim...

متن کامل

Pair-wise Separable Quadratic Programming for Constrained Time-varying Regression Estimation

Estimation of time-varying regression model constrained at each time moment by linear inequalities is a natural statistical formulation of a wide class of nonstationary signal processing problems. The presence of linear constraints turns the originally quadratic three-diagonal problem of minimizing the residual squares sum, which is solvable by the linear Kalman-Bucy filtration-smoothing proced...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Optimization Methods and Software

دوره 22  شماره 

صفحات  -

تاریخ انتشار 2007